Service-Oriented Matchmaking and Brokerage

نویسندگان

  • Tom Goodale
  • Simone A. Ludwig
  • William Naylor
  • Julian Padget
  • Omer F. Rana
چکیده

The GENSS project has developed a flexible generic brokerage framework based on the use of plug-in components that are themselves web services. The focus in GENSS has been on mathematical web services, but the broker itself is domain independent and it is the plug-ins that act as sources of domain-specific knowledge. A range of plug-ins has been developed that offer a variety of matching technologies including ontological reasoning, mathematical reasoning, reputation modelling, and textual analysis. The ranking mechanism too is a plug-in, thus we have a completely re-targettable matchmaking and brokerage shell plus a selection of useful packaged behaviours.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Building an Architecture for Discovery, Selection, Invocation and Personalization of Semantic Web Services

We propose a two-step matchmaking procedure for a Web Service oriented architecture to cope with scalability problems if a large amount of Web Services has to be processed. We distinguish between domain-aware and domainindependent matchmaking, and show how such a two-step matchmaking process can be realized. We discuss the approach within the Personal Reader architecture which enables the use o...

متن کامل

Flexible Matchmaking of Web Services Using DAML-S Ontologies

ABSTRACT Service discovery is one of the major challenges in the emerging area of Service Oriented Computing (SOC), which promotes the notion of service as the basic brick for the development of next generation distributed heterogeneous software systems. State-of-the-art matchmaking algorithms for Web services range from algorithms based on the DAML-S Service Profile to improved ones based on t...

متن کامل

Towards a Services-Based Process Platform

Service oriented software architectures that are aware of business processes will form the core of operational IT landscapes in the future. This contribution starts with an introduction of the state of the art in service oriented architectures. A concrete case study identifies central requirements that are not satisfied by these architectures so far. The authors argue that semantically rich des...

متن کامل

Semantic Matchmaking Algorithms

The advantages of loose coupling offered by service oriented architectures (SOA) have made it a popular choice for today’s enterprise systems. The popularity has driven standardization efforts in the areas of service advertisement and invocation and services specified using these standards are termed as Web services. A Web service is self containing, self describing application that can be depl...

متن کامل

Semantic Service Matchmaking in the ATM Domain Considering Infrastructure Capability Constraints

In a service-oriented environment business processes flexibly build on software services provided by systems in a network. A key design challenge is the semantic matchmaking of business processes and software services in two steps: 1. Find for one business process the software services that meet or exceed the BP requirements; 2. Find for all business processes the software services that can be ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006